Exploiting resolution proofs to speed up LTL vacuity detection for BMC
نویسندگان
چکیده
منابع مشابه
Exploiting Bounded Staleness to Speed Up Big Data Analytics
Many modern machine learning (ML) algorithms are iterative, converging on a final solution via many iterations over the input data. This paper explores approaches to exploiting these algorithms’ convergent nature to improve performance, by allowing parallel and distributed threads to use loose consistency models for shared algorithm state. Specifically, we focus on bounded staleness, in which e...
متن کاملExploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
Assume that a set U of memory locations is distributed among n memory modules, using some number a of hash functions h1; : : : ; ha, randomly and independently drawn from a high performance universal class of hash functions. Thus each memory location has a copies. Consider the task of accessing b out of the a copies for each of given keys x1; : : : ; xn 2 U , b < a. The paper presents and analy...
متن کاملExploiting velocity distribution skew to speed up moving object indexing
There has been intense research interest in moving object indexing in the past decade. However, existing work did not exploit the important property of skewed velocity distributions. In many real world scenarios, objects travel predominantly in only a few directions. Examples include vehicles on road networks, flights, people walking on the street, etc. The search space for a query is heavily d...
متن کاملExploiting Example Selection and Ordering to Speed-Up Learning
In this paper the results of a preliminary study on the effects of selection and ordering of examples in incremental machine learning are presented. We consider learning as a two agents communication process, in which the teacher supplies information to the learner according to a pre--defined protocol, in order to transfer to him the knowledge sufficient to solve a given problem. The aim of thi...
متن کاملOn Mathematical Proofs of the Vacuity of Compositionality
There is a widespread feeling among formal semanticists that, with suitable manipulations, any semantics can be made compositional. The following quote is representative: “. . . it [compositionality] being a methodological starting point, it is always possible to satisfy compositionality by simply adjusting the syntactic and/or semantic tools one uses, unless that is, the latter are constrained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2010
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-009-0134-1